منابع مشابه
Generalization of Universal Partition and Bipartition Theorems
Let A = (ai,j) , i = 1, 2, . . . , j = 0, 1, 2, . . . , be an infinite matrix with elements ai,j = 0 or 1; p (n, k;A) the number of partitions of n into k parts whose number yi of parts which are equal to i belongs to the set Yi = {j : ai,j = 1} , i = 1, 2, . . . . The universal theorem on partitions states that 1 X n=0 n X k=0 p (n, k;A)ut = 1 Y i=1 0 @ 1 X j=0 ai,ju t 1 A . In this paper, we ...
متن کاملHomogeneous bipartition based on multidimensional ranking
We present an algorithm which partitions a data set in two parts with equal size and experimentally nearly the same distribution measured through the likelihood of a Parzen kernel density estimator. The generation of the partition takes O( 1 2 N(N − 1)) operations (N number of data) and is 2 orders of magnitude faster than the state of the art. 1 Generating an equi-distributed bipartition 1.1 P...
متن کاملIntelligent Facial Emotion Recognition using modified-PSO
In this paper, a facial emotion recognition technique is proposed. The proposed technique employs modified-LBP, which conduct horizontal and vertical neighbourhood pixel comparison, to generate a discriminative initial facial representation. Then, a modified-PSO, is proposed to perform feature optimization.[2] The Facial emotion recognition system consists of three steps: 1) Feature Extraction;...
متن کاملBalanced Judicious Bipartition is Fixed-Parameter Tractable
The family of judicious partitioning problems, introduced by Bollobás and Scott to the field of extremal combinatorics, has been extensively studied from a structural point of view for over two decades. This rich realm of problems aims to counterbalance the objectives of classical partitioning problems such as Min Cut, Min Bisection and Max Cut. While these classical problems focus solely on th...
متن کاملArithmetic Properties of a Restricted Bipartition Function
A bipartition of n is an ordered pair of partitions (λ, μ) such that the sum of all of the parts equals n. In this article, we concentrate on the function c5(n), which counts the number of bipartitions (λ, μ) of n subject to the restriction that each part of μ is divisible by 5. We explicitly establish four Ramanujan type congruences and several infinite families of congruences for c5(n) modulo 3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Maxillofacial Surgery
سال: 2012
ISSN: 2231-0746
DOI: 10.4103/2231-0746.101348